Mind Forged Manacles

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Forged Dice

It is a well{known exercise in elementary probability that it is impossible to forge two ordinary dice with numbers 1;. . .; 6 in such a way that when one throws both and takes the sum one gets the numbers 2; 3;. . .; 12 all with the same probability. preceding assertion is just the statement that for m = 10, k 1 = k 2 = 5 there are no such probabilities. It will be shown how the k 1 ;. . .; k ...

متن کامل

DNS Resilience against Forged

This document specifies an Internet standards track protocol for the Internet community, and requests discussion and suggestions for improvements. Please refer to the current edition of the "Internet Official Protocol Standards" (STD 1) for the standardization state and status of this protocol. Distribution of this memo is unlimited. license-info) in effect on the date of publication of this do...

متن کامل

Detecting Forged TCP Reset Packets

Several off-the-shelf products enable network operators to enforce usage restrictions by actively terminating connections when deemed undesirable. While the spectrum of their application is large—from ISPs limiting the usage of P2P applications to the “Great Firewall of China”—many of these systems implement the same approach to disrupt the communication: they inject artificial TCP Reset (RST) ...

متن کامل

Search for Three forged Coins

We give a simple and efficient sequential weighing algorithm to search for three forged coins, with an asymptotic rate of 0.57, which is better than that (0.46) of the known static algorithm given by Lindström. Then we construct from the weighing algorithm an zero-error code for the three-user Multiple Access Adder Channel with feedback with rate 0.57.

متن کامل

0 Search for Three forged Coins

We give a simple and efficient sequential weighing algorithm to search for three forged coins, with an asymptotic rate of 0.57, which is better than that (0.46) of the known static algorithm given by Lindström. Then we construct from the weighing algorithm an zero-error code for the three-user Multiple Access Adder Channel with feedback with rate 0.57.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Index on Censorship

سال: 2007

ISSN: 0306-4220,1746-6067

DOI: 10.1080/03064220701249287